On using bounded continued fractions to represent reals
نویسندگان
چکیده
منابع مشابه
Revisited Using Continued Fractions
If the equation of the title has an integer solution with k ≥ 2, then m > 109.3·10 6 . This was the current best result and proved using a method due to L. Moser (1953). This approach cannot be improved to reach the benchmark m > 1010 7 . Here we achieve m > 1010 9 by showing that 2k/(2m−3) is a convergent of log 2 and making an extensive continued fraction digits calculation of (log 2)/N , wit...
متن کاملAddition Chains Using Continued Fractions
This paper introduces a new algorithm for the evaluation of monomials in two variables X " JJ~ based upon the continued fraction expansion of a/b. A method for fast explicit generation of addition chains of small length for a positive integer n is deduced from this Algorithm. As an illustration of the properties of the method, a Schoh-Brauer-like inequality p(N) s nb + k + p(n + l), is shown to...
متن کاملContinued Fractions with Partial Quotients Bounded in Average
We ask, for which n does there exists a k, 1 ≤ k < n and (k, n) = 1, so that k/n has a continued fraction whose partial quotients are bounded in average by a constant B? This question is intimately connected with several other well-known problems, and we provide a lower bound in the case of B = 2.
متن کاملVector continued fractions using a generalized inverse
A real vector space combined with an inverse (involution) for vectors is sufficient to define a vector continued fraction whose parameters consist of vector shifts and changes of scale. The choice of sign for different components of the vector inverse permits construction of vector analogues of the Jacobi continued fraction. These vector Jacobi fractions are related to vector and scalar-valued ...
متن کاملOn the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method’s good performance in practice. We derive an expected complexity bound of ÕB(d + d4τ2), where d is the polynomial degree and τ bounds the coefficient bit size, usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2003
ISSN: 1445-8810
DOI: 10.21914/anziamj.v45i0.932